Optimization of storage and picking systems in warehouses

La croissance du commerce électronique exige une hausse des performances des systèmes d'entreposage, qui sont maintenant repensés pour faire face à un volume massif de demandes à être satisfait le plus rapidement possible. Le système manuel et le système à robots mobile (SRM) sont parmi les plus utilisés pour ces activités. Le premier est un système centré sur l'humain pour réaliser des opérations complexes que les robots actuels ne peuvent pas effectuer. Cependant, les nouvelles générations de robots autonomes mènent à un remplacement progressif par le dernier pour augmenter la productivité. Quel que soit le système utilisé, plusieurs problèmes interdépendants doivent être résolus pour avoir des processus de stockage et de prélèvement efficaces. Les problèmes de stockage concernent les décisions d'où stocker les produits dans l'entrepôt. Les problèmes de prélèvement incluent le regroupement des commandes à exécuter ensemble et les itinéraires que les cueilleurs et les robots doivent suivre pour récupérer les produits demandés. Dans le système manuel, ces problèmes sont traditionnellement résolus à l'aide de politiques simples que les préparateurs peuvent facilement suivre. Malgré l'utilisation de robots, la même stratégie de solution est répliquée aux problèmes équivalents trouvés dans le SRM. Dans cette recherche, nous étudions les problèmes de stockage et de prélèvement rencontrés lors de la conception du système manuel et du SRM. Nous développons des outils d'optimisation pour aider à la prise de décision pour mettre en place leurs processus, en améliorant les mesures de performance typiques de ces systèmes. Certains problèmes traditionnels sont résolus avec des techniques améliorées, tandis que d'autres sont intégrés pour être résolus ensemble au lieu d'optimiser chaque sous-système de manière indépendante. Nous considérons d'abord un système manuel avec un ensemble connu de commandes et intégrons les décisions de stockage et de routage. Le problème intégré et certaines variantes tenant compte des politiques de routage communes sont modélisés mathématiquement. Une métaheuristique générale de recherche de voisinage variable est présentée pour traiter des instances de taille réelle. Des expériences attestent de l'efficience de la métaheuristique proposée par rapport aux modèles exacts et aux politiques de stockage communes. Lorsque les demandes futures sont incertaines, il est courant d'utiliser une stratégie de zonage qui divise la zone de stockage en zones et attribue les produits les plus demandés aux meilleures zones. Les tailles des zones sont à déterminer. Généralement, des dimensions arbitraires sont choisies, mais elles ignorent les caractéristiques de l'entrepôt et des demandes. Nous abordons le problème de dimensionnement des zones pour déterminer quels facteurs sont pertinents pour choisir de meilleures tailles de zone. Les données générées à partir de simulations exhaustives sont utilisées pour trainer quatre modèles de régression d'apprentissage automatique - moindres carrés ordinaire, arbre de régression, forêt aléatoire et perceptron multicouche - afin de prédire les dimensions optimales des zones en fonction de l'ensemble de facteurs pertinents identifiés. Nous montrons que tous les modèles entraînés suggèrent des dimensions sur mesure des zones qui performent meilleur que les dimensions arbitraires couramment utilisées. Une autre approche pour résoudre les problèmes de stockage pour le système manuel et pour le SRM considère les corrélations entre les produits. L'idée est que les produits régulièrement demandés ensemble doivent être stockés près pour réduire les coûts de routage. Cette politique de stockage peut être modélisée comme une variante du problème d'affectation quadratique (PAQ). Le PAQ est un problème combinatoire traditionnel et l'un des plus difficiles à résoudre. Nous examinons les variantes les plus connues du PAQ et développons une puissante métaheuristique itérative de recherche tabou mémétique en parallèle capable de les résoudre. La métaheuristique proposée s'avère être parmi les plus performantes pour le PAQ et surpasse considérablement l'état de l'art pour ses variantes. Les SRM permettent de repositionner facilement les pods d'inventaire pendant les opérations, ce qui peut conduire à un processus de prélèvement plus économe en énergie. Nous intégrons les décisions de repositionnement des pods à l'attribution des commandes et à la sélection des pods à l'aide d'une stratégie de prélèvement par vague. Les pods sont réorganisés en tenant compte du moment et de l'endroit où ils devraient être demandés au futur. Nous résolvons ce problème en utilisant la programmation stochastique en tenant compte de l'incertitude sur les demandes futures et suggérons une matheuristique de recherche locale pour résoudre des instances de taille réelle. Nous montrons que notre schéma d'approximation moyenne de l'échantillon est efficace pour simuler les demandes futures puisque nos méthodes améliorent les solutions trouvées lorsque les vagues sont planifiées sans tenir compte de l'avenir. Cette thèse est structurée comme suit. Après un chapitre d'introduction, nous présentons une revue de la littérature sur le système manuel et le SRM, et les décisions communes prises pour mettre en place leurs processus de stockage et de prélèvement. Les quatre chapitres suivants détaillent les études pour le problème de stockage et de routage intégré, le problème de dimensionnement des zones, le PAQ et le problème de repositionnement de pod. Nos conclusions sont résumées dans le dernier chapitre.The rising of e-commerce is demanding an increase in the performance of warehousing systems, which are being redesigned to deal with a mass volume of demands to be fulfilled as fast as possible. The manual system and the robotic mobile fulfillment system (RMFS) are among the most commonly used for these activities. The former is a human-centered system that handles complex operations that current robots cannot perform. However, newer generations of autonomous robots are leading to a gradual replacement by the latter to increase productivity. Regardless of the system used, several interdependent problems have to be solved to have efficient storage and picking processes. Storage problems concern decisions on where to store products within the warehouse. Picking problems include the batching of orders to be fulfilled together and the routes the pickers and robots should follow to retrieve the products demanded. In the manual system, these problems are traditionally solved using simple policies that pickers can easily follow. Despite using robots, the same solution strategy is being replicated to the equivalent problems found in the RMFS. In this research, we investigate storage and picking problems faced when designing manual and RMFS warehouses. We develop optimization tools to help in the decision-making process to set up their processes and improve typical performance measures considered in these systems. Some classic problems are solved with improved techniques, while others are integrated to be solved together instead of optimizing each subsystem sequentially. We first consider a manual system with a known set of orders and integrate storage and routing decisions. The integrated problem and some variants considering common routing policies are modeled mathematically. A general variable neighborhood search metaheuristic is presented to deal with real-size instances. Computational experiments attest to the effectiveness of the metaheuristic proposed compared to the exact models and common storage policies. When future demands are uncertain, it is common to use a zoning strategy to divide the storage area into zones and assign the most-demanded products to the best zones. Zone sizes are to be determined. Commonly, arbitrary sizes are chosen, which ignore the characteristics of the warehouse and the demands. We approach the zone sizing problem to determine which factors are relevant to choosing better zone sizes. Data generated from exhaustive simulations are used to train four machine learning regression models - ordinary least squares, regression tree, random forest, and multilayer perceptron - to predict the optimal zone sizes given the set of relevant factors identified. We show that all trained models suggest tailor-made zone sizes with better picking performance than the arbitrary ones commonly used. Another approach to solving storage problems, both in the manual and RMFS, considers the correlations between products. The idea is that products constantly demanded together should be stored closer to reduce routing costs. This storage policy can be modeled as a quadratic assignment problem (QAP) variant. The QAP is a traditional combinatorial problem and one of the hardest to solve. We survey the most traditional QAP variants and develop a powerful parallel memetic iterated tabu search metaheuristic capable of solving them. The proposed metaheuristic is shown to be among the best performing ones for the QAP and significantly outperforms the state-of-the-art for its variants. The RMFS allows easy repositioning of inventory pods during operations that can lead to a more energy-efficient picking process. We integrate pod repositioning decisions with order assignment and pod selection using a wave picking strategy such that pods are parked after being requested considering when and where they are expected to be requested next. We solve this integrated problem using stochastic programming considering the uncertainty about future demands and suggest a local search matheuristic to solve real-size instances. We show that our sample average approximation scheme is effective to simulate future demands since our methods improve solutions found when waves are planned without considering the future demands. This thesis is structured as follows. After an introductory chapter, we present a literature review on the manual and RMFS, and common decisions made to set up their storage and picking processes. The next four chapters detail the studies for the integrated storage and routing problem, the zone sizing problem, the QAP, and the pod repositioning problem. Our findings are summarized in the last chapter

The vehicle routing problem with simultaneous pickup and delivery and handling costs

In this paper we introduce the vehicle routing problem with simultaneous pickup and delivery and handling costs (VRPSPD-H). In the VRPSPD-H, a fleet of vehicles operates from a single depot to service all customers, which have both a delivery and a pickup demand such that all delivery items originate from and all pickup items go to the depot. The items on the vehicles are organized as a single linear stack where only the last loaded item is accessible. Handling operations are required if the delivery items are not the last loaded ones. We implement a heuristic handling policy approximating the optimal decisions for the handling sub-problem, and we propose two bounds on the optimal policy, resulting in two new myopic policies. We show that one of the myopic policies outperforms the other one in all configurations, and that it is competitive with the heuristic handling policy if many routes are required. We propose an adaptive large neighborhood search (ALNS) metaheuristic to solve our problem, in which we embed the handling policies. Computational results indicate that our metaheuristic finds optimal solutions on instances of up to 15 customers. We also compare our ALNS metaheuristic against best solutions on benchmark instances of two special cases, the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) and the traveling salesman problem with pickups, deliveries and handling costs (TSPPD-H), and on two related problems, the vehicle routing problem with divisible pickup and delivery (VRPDPD) and the vehicle routing problem with mixed pickup and delivery (VRPMPD). We find or improve 39 out of 54 best known solutions (BKS) for the VRPSPD, 36 out of 54 BKS for the VRPDPD, 15 out of 21 BKS for the VRPMPD, and 69 out of 80 BKS for the TSPPD-H. Finally, we introduce and analyze solutions for the variations of the VRPDPD and VRPMPD with handling costs – the VRPDPD-H and the VRPMPD-H, respectively

Bond strength according to the moment of fiber post cutting fixed with self-adhesive cement to the root dentin

The fiber posts require a cut in the coronal portion to adjust it to the available clinical space. The cutting of posts cemented may generate tension via bur vibrations of drill on the bonding interface, with the possibility of decreasing the bond streng

Trehalose alleviates the phenotype of Machado–Joseph disease mouse models

Machado-Joseph disease (MJD), also known as spinocerebellar ataxia type 3, is the most common of the dominantly inherited ataxias worldwide and is characterized by mutant ataxin-3 aggregation and neuronal degeneration. There is no treatment available to block or delay disease progression. In this work we investigated whether trehalose, a natural occurring disaccharide widely used in food and cosmetic industry, would rescue biochemical, behavioral and neuropathological features of an in vitro and of a severe MJD transgenic mouse model.This work was funded by BioBlast Pharma, the ERDF through the Regional Operational Program Center 2020, Competitiveness Factors Operational Program (COMPETE 2020) and National Funds through FCT (Foundation for Science and Technology) - SFRH/BD/87404/2012, BrainHealth2020 projects (CENTRO-01-0145-FEDER-000008), ViraVector (CENTRO-01-0145FEDER-022095), CortaCAGs (POCI-01-0145-FEDER-016719), SpreadSilenc‑ing POCI-01-0145-FEDER-029716 and POCI-01-0145-FEDER-007440, as well as the SynSpread, ESMI and ModelPolyQ under the EU Joint ProgramNeurodegenerative Disease Research (JPND), the last two co-funded bythe European Union H2020 program, GA No. 643417; by National Ataxia Foundation (USA), the American Portuguese Biomedical Research Fund (APBRF) and the Richard Chin and Lily Lock Machado–Joseph Disease Research Fund.info:eu-repo/semantics/publishedVersio

A CRÍTICA DE RICHARD RORTY À EPISTEMOLOGIA NA OBRA "PHILOSOPHY AND THE MIRROR OF NATURE"

O propósito deste artigo consiste em expor e desenvolver a crítica feita por Richard Rorty à epistemologia. Para isso, iremos nos valer dos principais argumentos presentes em sua obra Philosophy and the Mirror of Nature (1979). Dado esses pressupostos, propomos dividir este trabalho em três partes. A primeira consiste em apresentar as principais ideias contidas na obra publicada em 1979. A segunda, no que lhe concerne, mostrará a relação de proximidade existente entre o problema do dualismo substancial – a relação entre o corpo e a mente – e o problema epistemológico. Ao fazermos isso, veremos como as limitações do primeiro, conforme ele, foram responsáveis pelas limitações do segundo, em estreita conexão. Por fim, após seguirmos este percurso, no terceiro momento, entenderemos a importância da crítica de Rorty, antepondo a isso o desenvolvimento propiciado pela virada pragmático-linguística, bem como pelas suas principais discussões

Um olhar sobre os jogos escolares do Rio Grande do Norte: recortes da história da capoeira no estado

Falar sobre capoeira como prática esportiva é algo muito recente nos diferentes espaços, pois, tradicionalmente, ela recebe uma ênfase em sua vertente cultural do que propriamente como esporte e suas especificidades quando comparada a outras manifestações da cultura de movimento. Nesse sentido, apresentamos uma pesquisa piloto para registrar e compreender como a Capoeira foi historicamente constituída nos espaços estudantis, especificamente, nos Jogos Escolares do estado do Rio Grande do Norte. Nestes termos, o presente estudo caracteriza-se como uma pesquisa descritiva que faz uso de entrevistas e documentos para compreender o fenômeno estudado, utilizando como referências a oralidade e o acervo do Mestre Marcos. Identificamos que os Jogos Escolares Brasileiros disseminaram a Capoeira como esporte-competição a todo Brasil e influenciaram diretamente a introdução da Capoeira nos Jogos Escolares do Rio Grande do Norte

Natural regeneration of the shrub-tree stratum in areas of caatinga at the Seridó Ecological Station, RN, Brazil

The objective of this study was to evaluate the composition and floristic similarity, regeneration origin and the influence of silviculture systems on the diversity and absolute density of regeneration of the shrub-tree stratum in two areas of Caatinga. The first area is in the Seridó Ecological Station and the second is on Pedro Candido Farm, in the city of Serra Negra do Norte, in the Seridó region of RN, Brazil. In each area, 16 subplots of 25m2 were delimited and individuals with a base circumference ≤ 6 cm and a height > 0.5 m were included in the study. The plants were classified according to origin of regeneration (seeds or budding). The following parameters were calculated: frequency, density, Shannon’s diversity index, Pielou’s evenness index and Jaccard’s index. The sample included 2112 individuals belonging to 13 species, 11 genera and seven families. Considering the two areas, the values for density, Shannon’s index and Pielou’s index diverged in both years of the study. Regeneration by seeds was predominant in the two locations. After 22 to 24 years of silvicultural intervention, it was found that the treatments had no influence on density and floristic diversity

Asteroseismic properties of solar-type stars observed with the NASA K2 mission: results from Campaigns 1-3 and prospects for future observations

We present an asteroseismic analysis of 33 solar-type stars observed in short cadence during Campaigns (C) 1-3 of the NASA K2 mission. We were able to extract both average seismic parameters and individual mode frequencies for stars with dominant frequencies up to ~3300{\mu}Hz, and we find that data for some targets are good enough to allow for a measurement of the rotational splitting. Modelling of the extracted parameters is performed by using grid-based methods using average parameters and individual frequencies together with spectroscopic parameters. For the target selection in C3, stars were chosen as in C1 and C2 to cover a wide range in parameter space to better understand the performance and noise characteristics. For C3 we still detected oscillations in 73% of the observed stars that we proposed. Future K2 campaigns hold great promise for the study of nearby clusters and the chemical evolution and age-metallicity relation of nearby field stars in the solar neighbourhood. We expect oscillations to be detected in ~388 short-cadence targets if the K2 mission continues until C18, which will greatly complement the ~500 detections of solar-like oscillations made for short-cadence targets during the nominal Kepler mission. For ~30-40 of these, including several members of the Hyades open cluster, we furthermore expect that inference from interferometry should be possible.Comment: 17 pages, 15 figures, 4 tables; accepted for publication in PAS